github.com/klauspost/compress/zstd.match.length (field)

22 uses

	github.com/klauspost/compress/zstd (current package)
		enc_best.go#L32: 	length int32
		enc_best.go#L41: 	mlc := mlCode(uint32(m.length - zstdMinMatch))
		enc_best.go#L55: 	m.est -= (m.length * bitsPerByte) >> 10
		enc_best.go#L58: 		m.length = 0
		enc_best.go#L215: 			if m.length > 16 {
		enc_best.go#L216: 				left := len(src) - int(m.s+m.length)
		enc_best.go#L221: 				checkLen := m.length - (s - m.s) - 8
		enc_best.go#L251: 			cand := match{offset: offset, s: s, length: l, rep: rep}
		enc_best.go#L264: 		if canRepeat && best.length < goodEnough {
		enc_best.go#L296: 		if best.length < goodEnough {
		enc_best.go#L298: 			if best.length < 4 {
		enc_best.go#L332: 				if sAt := best.s + best.length; sAt < sLimit {
		enc_best.go#L336: 					if off := candidateEnd.offset - e.cur - best.length + skipBeginning; off >= 0 {
		enc_best.go#L338: 						if off := candidateEnd.prev - e.cur - best.length + skipBeginning; off >= 0 {
		enc_best.go#L356: 			if !bytes.Equal(src[best.s:best.s+best.length], src[best.offset:best.offset+best.length]) {
		enc_best.go#L357: 				panic(fmt.Sprintf("match mismatch: %v != %v", src[best.s:best.s+best.length], src[best.offset:best.offset+best.length]))
		enc_best.go#L365: 			seq.matchLen = uint32(best.length - zstdMinMatch)
		enc_best.go#L376: 			s = best.s + best.length
		enc_best.go#L402: 					println("repeat ended", s, best.length)
		enc_best.go#L424: 		l := best.length